|
Strictly speaking, in linear algebra, two matrices are row equivalent if one can be changed to the other by a sequence of elementary row operations. Alternatively, two ''m'' × ''n'' matrices are row equivalent if and only if they have the same row space. The concept is most commonly applied to matrices that represent systems of linear equations, in which case two matrices of the same size are row equivalent if and only if the corresponding homogeneous systems have the same set of solutions, or equivalently the matrices have the same null space. Because elementary row operations are reversible, row equivalence is an equivalence relation. It is commonly denoted by a tilde (~). There is a similar notion of column equivalence, defined by elementary column operations; two matrices are column equivalent if and only if their transpose matrices are row equivalent. Two rectangular matrices that can be converted into one another allowing both elementary row and column operations are called simply equivalent. ==Elementary row operations== An elementary row operation is any one of the following moves: # Swap: Swap two rows of a matrix. # Scale: Multiply a row of a matrix by a nonzero constant. # Pivot: Add a multiple of one row of a matrix to another row. Two matrices ''A'' and ''B'' are row equivalent if it is possible to transform ''A'' into ''B'' by a sequence of elementary row operations. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Row equivalence」の詳細全文を読む スポンサード リンク
|